integer factoring造句

例句与造句

1. The first use of it came from Carl Pomerance in his paper " Analysis and comparison of some integer factoring algorithms ".
2. However, many of the underlying assumptions in cryptography are related but not always equivalent to integer factoring, e . g.
3. However, for the integer factoring and discrete logarithm algorithms that L-notation is commonly used for, the running time is not an upper bound, so this definition is not preferred.
4. The most famous of these is integer factorization ( e . g ., the RSA algorithm is based on a problem related to integer factoring ), but the discrete logarithm problem is also important.
5. :Regarding your subject line : note that there are algorithms that run in super-polynomial but sub-exponential time, such as the best known algorithms for integer factoring and talk ) 23 : 45, 12 March 2012 ( UTC)
6. It's difficult to find integer factoring in a sentence. 用integer factoring造句挺难的
7. :: The reason why integer factoring ( or more precisely, a decision version of factoring; integer factoring itself is a function problem rather than a decision problem, hence its comparison with classes of decision problems like NP is meaningless ) is considered not to be NP-hard is that it is in { \ rm NP } \ cap { \ rm coNP }, hence if it were NP-hard then the polynomial hierarchy collapses to PH = NP = co-NP .  J . 10 : 48, 16 June 2009 ( UTC)
8. :: The reason why integer factoring ( or more precisely, a decision version of factoring; integer factoring itself is a function problem rather than a decision problem, hence its comparison with classes of decision problems like NP is meaningless ) is considered not to be NP-hard is that it is in { \ rm NP } \ cap { \ rm coNP }, hence if it were NP-hard then the polynomial hierarchy collapses to PH = NP = co-NP .  J . 10 : 48, 16 June 2009 ( UTC)